naive algorithm造句

• A slightly more accurate compensated version performs the full naive algorithm on the residuals.
• A naive algorithm will search from left to right, one element at a time.
• However, in comparison to the naive algorithm used here, both of these drawbacks are relatively minimal.
• The naive algorithm for single linkage clustering is essentially the same as Kruskal's algorithm for minimum spanning trees.
• Thus, research in this area has concentrated on two goals : using less space than this naive algorithm, and finding pointer algorithms that use fewer equality tests.
• Using the ideas of Lowrance and Wagner, this naive algorithm can be improved to be O \ left ( M \ cdot N \ right ) in the worst case.
• In the naive algorithm for agglomerative clustering, implementing a different linkage scheme may be accomplished simply by using a different formula to calculate inter-cluster distances in the algorithm ..
• The reduction in the number of arithmetic operations however comes at the price of a somewhat reduced numerical stability, and the algorithm also requires significantly more memory compared to the naive algorithm.
• In such cases color-out algorithms are used to come out of SSA . Naive algorithms introduce a copy along each predecessor path which caused a source of different root symbol to be put in phi than the destination of phi.
• Strassen's algorithm works for any ring, such as plus / multiply, but not all semirings, such as min / plus or boolean algebra, where the naive algorithm still works, and so called combinatorial matrix multiplication.
• While this is a conceptually simple operation, the computational complexity of the step can be non-trivial : a naive algorithm would scan the expression " E " for all occurrences of the free variable " x ".
• Alternative linkage schemes include average linkage clustering-implementing a different linkage in the naive algorithm is simply a matter of using a different formula to calculate inter-cluster distances in the initial computation of the proximity matrix and in step 4 of the above algorithm.
• In 1969, Strassen shifted his research efforts towards the analysis of algorithms with a paper on Gaussian elimination, introducing Strassen's algorithm, the first algorithm for performing matrix multiplication faster than the O ( " n " 3 ) time bound that would result from a naive algorithm.
• If sets are implemented as sorted lists, for example, the naive algorithm for union ( " S ", " T " ) will take time proportional to the length " m " of " S " times the length " n " of " T "; whereas a variant of the union-find data structure ) that are optimized for one or more of these operations, at the expense of others.
• When " R " is a power of a small positive integer " b ", can be computed by Hensel's lemma : The inverse of " N " modulo " b " is computed by a naive algorithm ( for instance, if then the inverse is 1 ), and Hensel's lemma is used repeatedly to find the inverse modulo higher and higher powers of " b ", stopping when the inverse modulo " R " is known; is the negation of this inverse.